Splittable pseudorandom number generators using cryptographic hashing
نویسندگان
چکیده
منابع مشابه
Evolving Cryptographic Pseudorandom Number Generators
Random number generators (RNGs) play an important role in many real-world applications. Besides true hardware RNGs, one important class are deterministic random number generators. Such generators do not possess the unpredictability of true RNGs, but still have a widespread usage. For a deterministic RNG to be used in cryptography, it needs to fulfill a number of conditions related to the speed,...
متن کاملEmpirical Pseudorandom Number Generators
The most common pseudorandom number generator or PRNG, the linear congruential generator or LCG, belongs to a whole class of rational congruential generators. These generators work by multiplicative congruential method for integers, which implements a ”grow-and-cut procedure”. We extend this concept to real numbers and call this the real congruence, which produces another class of random number...
متن کاملCryptographic random and pseudorandom data generators
This dissertation thesis deals with cryptographic random and pseudorandom data generators in mobile computing environments (such as mobile phones, personal digital assistants, cryptographic smartcards). These mobile devices are typically bounded by the amount of energy, performance, memory or even silicon area. This lack of resources leads to very limited computing environments with: a) limited...
متن کاملEngineering Nonlinear Pseudorandom Number Generators
In the era of multi and many-core processors, computer simulations increasingly require parallel, small and fast pseudorandom number generation. Although linear generators lend themselves to a simpler evaluation that ensures favorable properties like guaranteed period, they may adversely affect the result of simulations or be quite large. Conversely, nonlinear generators may provide apparently ...
متن کاملPredicting nonlinear pseudorandom number generators
Let p be a prime and let a and b be elements of the finite field Fp of p elements. The inversive congruential generator (ICG) is a sequence (un) of pseudorandom numbers defined by the relation un+1 ≡ au−1 n +b mod p. We show that if sufficiently many of the most significant bits of several consecutive values un of the ICG are given, one can recover the initial value u0 (even in the case where t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2014
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2578854.2503784